Future Path-components in Directed Topology
نویسندگان
چکیده
منابع مشابه
Future Path-components in Directed Topology
The global states of complex systems often form pospaces, topological spaces equipped with compatible partial orders reflecting causal relationships between the states. The calculation of tractable invariants on such pospaces can reveal critical system behavior unseen by ordinary invariants on the underlying spaces, thereby sometimes cirumventing the state space problem bedevilling static analy...
متن کاملTopology Aggregation for Directed
-This paper addresses the problem of aggregating the topology of a sub-network in a compact way with minimum distortion. The problem arises from networks that have a hierarchical structure, where each sub-network must advertise the cost of routing between each pair of its border nodes. The straight-forward solution of advertising the exact cost for each pair has a quadratic cost which is not pr...
متن کاملData Path Rib Topology
Constraint-based routing gradually becomes an essential enabling mechanism for a variety of emerging network services such as virtual private networking and QoS support. A number of recent works have recognized its signiicance and investigated many aspects of the operation of constraint based routing and in particular its variant that is concerned with determining paths for requests with specii...
متن کاملFrom Path Graphs to Directed Path Graphs
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to find an odd sun when the method fails. This algorithm has several interesting consequences concerning the relationship between path graphs and directed path graphs. One is that for a directed path graph, path graph mode...
متن کاملMode Directed Path Finding
Learning from multi-relational domains has gained increasing attention over the past few years. Inductive logic programming (ILP) systems, which often rely on hill-climbing heuristics in learning first-order concepts, have been a dominating force in the area of multi-relational concept learning. However, hill-climbing heuristics are susceptible to local maxima and plateaus. In this paper, we sh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2010
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2010.08.019